51![BRICS Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph On the Number of Maximal Independent Sets BRICS Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph On the Number of Maximal Independent Sets](https://www.pdfsearch.io/img/756a66c7e49f0e2e8fa88f31c7a3a269.jpg) | Add to Reading ListSource URL: www.brics.dkLanguage: English - Date: 2002-04-12 04:11:55
|
---|
52![](https://www.pdfsearch.io/img/e389ffef172141d58f26d0d93916cb7e.jpg) | Add to Reading ListSource URL: www.cs.technion.ac.ilLanguage: English - Date: 2013-04-17 12:02:13
|
---|
53![On Chromatic Sums and Distributed Resource Allocation Amotz Bar-Noy∗ Mihir Bellare† Hadas Shachnai§ On Chromatic Sums and Distributed Resource Allocation Amotz Bar-Noy∗ Mihir Bellare† Hadas Shachnai§](https://www.pdfsearch.io/img/4a0c6f76581f51b2550da6d729a84d29.jpg) | Add to Reading ListSource URL: www.cs.technion.ac.ilLanguage: English - Date: 2013-04-15 10:45:37
|
---|
54![Distributed Computing over Communication Networks: Maximal Independent Set Distributed Computing over Communication Networks: Maximal Independent Set](https://www.pdfsearch.io/img/63afe783e8809d09eaddc13b2ec88ce4.jpg) | Add to Reading ListSource URL: www.net.t-labs.tu-berlin.deLanguage: English - Date: 2011-06-28 01:58:12
|
---|
55![70 CHAPTER 7. MAXIMAL INDEPENDENT SET Remarks: • Computing a maximum independent set (MaxIS) is a notoriously difficult 70 CHAPTER 7. MAXIMAL INDEPENDENT SET Remarks: • Computing a maximum independent set (MaxIS) is a notoriously difficult](https://www.pdfsearch.io/img/06fdcd98873a8fc1de063d84b2a3e351.jpg) | Add to Reading ListSource URL: dcg.ethz.chLanguage: English - Date: 2014-09-26 08:28:48
|
---|
56![Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher](https://www.pdfsearch.io/img/29cac9f67c7f7bda3df6b39c3c66516b.jpg) | Add to Reading ListSource URL: dcg.ethz.chLanguage: English - Date: 2014-09-26 08:28:46
|
---|
57![Chapter 7 Maximal Independent Set In this chapter we present a highlight of this course, a fast maximal independent set (MIS) algorithm. The algorithm is the first randomized algorithm that we study in this class. In di Chapter 7 Maximal Independent Set In this chapter we present a highlight of this course, a fast maximal independent set (MIS) algorithm. The algorithm is the first randomized algorithm that we study in this class. In di](https://www.pdfsearch.io/img/b16972251731c3cb69a100bc3592a903.jpg) | Add to Reading ListSource URL: dcg.ethz.chLanguage: English - Date: 2014-09-26 08:28:48
|
---|
58![Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§ Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§](https://www.pdfsearch.io/img/3b5500ae4f93d8f8963e8f5fa7ebf99f.jpg) | Add to Reading ListSource URL: www.dim.uchile.clLanguage: English - Date: 2009-10-29 15:21:24
|
---|
59![CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub](https://www.pdfsearch.io/img/1044bf1bd10728b866adff06d334d155.jpg) | Add to Reading ListSource URL: cccg.caLanguage: English - Date: 2010-07-19 10:46:18
|
---|
60![](https://www.pdfsearch.io/img/58e347b6923e03c67caaaca3a96082ff.jpg) | Add to Reading ListSource URL: dcg.ethz.chLanguage: English - Date: 2014-09-26 08:28:49
|
---|